package mo.leetcode_top;

public class L190 {

    public int reverseBits(int n) {
        int res = 0;
        for (int i = 0; i < 32; i++) {
            res = res << 1;
            res = res | (n & 1);
            n = n >> 1;
        }
        return res;
    }

    public static void main(String[] args) {
        L190 test = new L190();
        System.out.println(test.reverseBits(43261596));
    }
}
